//
// Created by Jisam on 14/09/2024 7:37 PM.
// Solution of  魔法书
#pragma GCC optimize(3)
#include <bits/stdc++.h>

using namespace std;
typedef long long i64;
const int mod = 998244353,MAXN = 1e5+5;
inline int read()
{
    int x = 0,f = 1;
    char ch = getchar();
    while (ch < '0' || ch>'9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}

int n,k;
void solution() {
    n = read();
    k = read();
    i64 ans = 0;
    for(int i = 1 ; i <= 10000 ; ++i)
    {
        if(a[i] % k == 0){
            ans ++;
        }
    }
//    printf("%d",ans % mod);
}

int main() {
    solution();
    return 0;
}